#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;

int n, m;
int num[N];

// 排序+二分:需要注意的是 要排除掉自己本身这个硬币，所以用一个hash表来记录每种硬币的种类数量
inline void solution() {
    unordered_map<int, int> hash;
    cin >> n >> m;
    for (int i = 0; i < n; i ++ ) {
        cin >> num[i];
        hash[num[i]] ++ ;
    }
    sort(num, num + n);

    for (int i = 0; i < n; i ++ ) {
        int v = num[i];
        int diff = m - v;
        int pos = lower_bound(num, num + n, diff) - num;
        if (num[pos] == diff) {
            if (pos == i) {
                if (hash[pos] > 1) {
                    cout << num[i] << " " << num[pos] << endl;
                    return ;
                } else continue;
            } else {
                cout << num[i] << " " << num[pos] << endl;
                return ;
            }
        }
    }
    cout << "No Solution" << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}